翻訳と辞書 |
Decidable sublanguages of set theory : ウィキペディア英語版 | Decidable sublanguages of set theory
In mathematical logic, various sublanguages of set theory are decidable.〔Cantone, D., E. G. Omodeo and A. Policriti, "Set Theory for Computing. From Decision Procedures to Logic Programming with Sets," Monographs in Computer Science, Springer, 2001.〕〔("Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability", by Franco Parlamento and Alberto Policriti Journal of Automated Reasoning, Volume 7 , Issue 2 (June 1991), Pages: 271 - 284 )〕 These include: * Sets with Monotone, Additive, and Multiplicative Functions.〔("A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions", by Domenico Cantone and et al. )〕 * Sets with restricted quantifiers.〔("A tableau-based decision procedure for a fragment of set theory involving a restricted form of quantification", by Domenico Cantone, Calogero G. Zarba, Viale A. Doria, 1997 )〕 ==References== 〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Decidable sublanguages of set theory」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|